The g-Extra Edge-Connectivity of Balanced Hypercubes
نویسندگان
چکیده
The [Formula: see text]-extra edge-connectivity is an important measure for the reliability of interconnection networks. Recently, Yang et al. [Appl. Math. Comput. 320 (2018) 464–473] determined balanced hypercubes text] and conjectured that text]. In this paper, we confirm their conjecture text], disprove where
منابع مشابه
The g-Extra Conditional Diagnosability of Folded Hypercubes
Diagnosability plays a crucial role in measuring the reliability and fault tolerance of interconnection networks. The g-extra conditional diagnosability of multiprocessor systems is a new diagnosability, which is more accurate than the classical diagnosability. In this paper, we show that the g-extra conditional diagnosability t̃g(FQn) of the folded hypercube FQn is (g + 1)n − ( g 2 ) + 1 under ...
متن کاملExtra edge connectivity of hypercube-like networks
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملTHE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G
To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملEdge-fault-tolerant edge-bipancyclicity of hypercubes
In this paper, we consider the problem embedding a cycle into the hypercube Qn with existence of faulty edges and show that for any edge subset F of Qn with |F | n− 1 every edge of Qn − F lies on a cycle of every even length from 6 to 2n inclusive provided n 4 and all edges in F are not incident with the same vertex. This result improves some known results. 2005 Published by Elsevier B.V.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Interconnection Networks
سال: 2021
ISSN: ['0219-2659', '1793-6713']
DOI: https://doi.org/10.1142/s0219265921420081